Determining Solution Space Characteristics for Real-Time Strategy Games and Characterizing Winning Strategies

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Determining Solution Space Characteristics for Real-Time Strategy Games and Characterizing Winning Strategies

The underlying goal of a competing agent in a discrete real-time strategy (RTS) game is to defeat an adversary. Strategic agents or participants must define an a priori plan to maneuver their resources in order to destroy the adversary and the adversary’s resources as well as secure physical regions of the environment. This a priori plan can be generated by leveraging collected historical knowl...

متن کامل

Determining Solution Space Characteristics for Real Time Strategy Games & Characterizing Winning Strategies

The underlying goal of a competing agent in a discrete real time strategy (RTS) game is to defeat an adversary. Strategic agents or participants must define an a priori plan to maneuver their resources in order to destroy the adversary and the adversary’s resources as well as secure physical regions of the environment. This a priori plan can be generated by leveraging collected historical knowl...

متن کامل

Time-Optimal Winning Strategies for Poset Games

We introduce a novel winning condition for infinite two-player games on graphs which extends the request-response condition and better matches concrete applications in scheduling or project planning. In a poset game, a request has to be responded by multiple events in an ordering over time that is compatible with a given partial ordering of the events. Poset games are zero-sum, but there are pl...

متن کامل

Games and Winning Strategies

'ILvo-person games are modeled as specifications in a language with angelic and demonic nondeterminism, and methods of program verification and transformation are used to reason about games. That a given strategy is winning can be proved using a variant of the traditional loop correctness rule. Furthermore, an implementation of the winning strategy can be derived using equivalence transformations.

متن کامل

Time-optimal Winning Strategies in Infinite Games

Infinite Games are an important tool in the synthesis of finite-state controllers for reactive systems. The interaction between the environment and the system is modeled by a finite graph. The specification that has to be satisfied by the controlled system is translated into a winning condition on the infinite paths of the graph. Then, a winning strategy is a controller that is correct with res...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer Games Technology

سال: 2011

ISSN: 1687-7047,1687-7055

DOI: 10.1155/2011/834026